0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.35	% Computer   : n015.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Jul 13 13:16:04 EDT 2021
0.13/0.35	% CPUTime    : 
0.20/0.35	% Number of cores: 8
0.20/0.35	% Python version: Python 3.6.8
0.20/0.36	# Version: 2.6rc1-ho
0.20/0.36	# No SInE strategy applied
0.20/0.36	# Trying AutoSched0 for 59 seconds
0.21/0.55	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.21/0.55	# and selection function SelectMaxLComplexAvoidPosPred.
0.21/0.55	#
0.21/0.55	# Preprocessing time       : 0.061 s
0.21/0.55	
0.21/0.55	# Proof found!
0.21/0.55	# SZS status Theorem
0.21/0.55	# SZS output start CNFRefutation
0.21/0.55	thf(fact_4_calculation, axiom, (groups1842438620at_nat @ (^[X15:nat]:times_times_nat @ (fun_upd_nat_nat @ p @ k @ (minus_minus_nat @ (p @ k) @ one_one_nat) @ X15) @ X15) @ (set_ord_atMost_nat @ (minus_minus_nat @ n @ k)))=(minus_minus_nat @ (groups1842438620at_nat @ (^[X15:nat]:times_times_nat @ (p @ X15) @ X15) @ (set_ord_atMost_nat @ n)) @ k), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_4_calculation)).
0.21/0.55	thf(fact_3__092_060open_062_I_092_060Sum_062i_092_060le_062n_A_N_Ak_O_A_Ip_Ik_A_058_061_Ap_Ak_A_N_A1_J_J_Ai_A_K_Ai_J_A_061_A_I_092_060Sum_062i_092_060le_062n_O_A_Ip_Ik_A_058_061_Ap_Ak_A_N_A1_J_J_Ai_A_K_Ai_J_092_060close_062, axiom, (groups1842438620at_nat @ (^[X15:nat]:times_times_nat @ (fun_upd_nat_nat @ p @ k @ (minus_minus_nat @ (p @ k) @ one_one_nat) @ X15) @ X15) @ (set_ord_atMost_nat @ (minus_minus_nat @ n @ k)))=(groups1842438620at_nat @ (^[X15:nat]:times_times_nat @ (fun_upd_nat_nat @ p @ k @ (minus_minus_nat @ (p @ k) @ one_one_nat) @ X15) @ X15) @ (set_ord_atMost_nat @ n)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_3__092_060open_062_I_092_060Sum_062i_092_060le_062n_A_N_Ak_O_A_Ip_Ik_A_058_061_Ap_Ak_A_N_A1_J_J_Ai_A_K_Ai_J_A_061_A_I_092_060Sum_062i_092_060le_062n_O_A_Ip_Ik_A_058_061_Ap_Ak_A_N_A1_J_J_Ai_A_K_Ai_J_092_060close_062)).
0.21/0.55	thf(fact_61_partitions__def, axiom, (number1551313001itions)=(^[X71:nat > nat, X13:nat]:(![X15:nat]:((X71 @ X15)!=(zero_zero_nat)=>(ord_less_eq_nat @ one_one_nat @ X15&ord_less_eq_nat @ X15 @ X13))&(groups1842438620at_nat @ (^[X15:nat]:times_times_nat @ (X71 @ X15) @ X15) @ (set_ord_atMost_nat @ X13))=(X13))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_61_partitions__def)).
0.21/0.55	thf(conj_0, conjecture, (minus_minus_nat @ (groups1842438620at_nat @ (^[X15:nat]:times_times_nat @ (p @ X15) @ X15) @ (set_ord_atMost_nat @ n)) @ k)=(minus_minus_nat @ n @ k), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
0.21/0.55	thf(fact_0_partitions, axiom, number1551313001itions @ p @ n, file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_partitions)).
0.21/0.55	thf(c_0_5, plain, ![X15:nat, X28:nat > nat]:(esk3_2 @ X28 @ X15)=(times_times_nat @ (X28 @ X15) @ X15), introduced(definition)).
0.21/0.55	thf(c_0_6, plain, ![X15:nat]:(esk1_1 @ X15)=(times_times_nat @ (fun_upd_nat_nat @ p @ k @ (minus_minus_nat @ (p @ k) @ one_one_nat) @ X15) @ X15), introduced(definition)).
0.21/0.55	thf(c_0_7, axiom, (groups1842438620at_nat @ esk1_1 @ (set_ord_atMost_nat @ (minus_minus_nat @ n @ k)))=(minus_minus_nat @ (groups1842438620at_nat @ (esk3_2 @ p) @ (set_ord_atMost_nat @ n)) @ k), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[fact_4_calculation, c_0_5]), c_0_6])).
0.21/0.55	thf(c_0_8, axiom, (groups1842438620at_nat @ esk1_1 @ (set_ord_atMost_nat @ (minus_minus_nat @ n @ k)))=(groups1842438620at_nat @ esk1_1 @ (set_ord_atMost_nat @ n)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[fact_3__092_060open_062_I_092_060Sum_062i_092_060le_062n_A_N_Ak_O_A_Ip_Ik_A_058_061_Ap_Ak_A_N_A1_J_J_Ai_A_K_Ai_J_A_061_A_I_092_060Sum_062i_092_060le_062n_O_A_Ip_Ik_A_058_061_Ap_Ak_A_N_A1_J_J_Ai_A_K_Ai_J_092_060close_062, c_0_6]), c_0_6])).
0.21/0.55	thf(c_0_9, plain, ![X71:nat > nat, X13:nat]:(number1551313001itions @ X71 @ X13<=>(![X788:nat]:((X71 @ X788)!=(zero_zero_nat)=>(ord_less_eq_nat @ one_one_nat @ X788&ord_less_eq_nat @ X788 @ X13))&(groups1842438620at_nat @ (esk3_2 @ X71) @ (set_ord_atMost_nat @ X13))=(X13))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_61_partitions__def]), c_0_5])).
0.21/0.55	thf(c_0_10, negated_conjecture, (minus_minus_nat @ (groups1842438620at_nat @ (esk3_2 @ p) @ (set_ord_atMost_nat @ n)) @ k)!=(minus_minus_nat @ n @ k), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0]), c_0_5])])).
0.21/0.55	thf(c_0_11, plain, (groups1842438620at_nat @ esk1_1 @ (set_ord_atMost_nat @ (minus_minus_nat @ n @ k)))=(minus_minus_nat @ (groups1842438620at_nat @ (esk3_2 @ p) @ (set_ord_atMost_nat @ n)) @ k), inference(split_conjunct,[status(thm)],[c_0_7])).
0.21/0.55	thf(c_0_12, plain, (groups1842438620at_nat @ esk1_1 @ (set_ord_atMost_nat @ (minus_minus_nat @ n @ k)))=(groups1842438620at_nat @ esk1_1 @ (set_ord_atMost_nat @ n)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.55	thf(c_0_13, plain, ![X991:nat > nat, X992:nat, X993:nat, X994:nat > nat, X995:nat]:((((ord_less_eq_nat @ one_one_nat @ X993|(X991 @ X993)=(zero_zero_nat)|~number1551313001itions @ X991 @ X992)&(ord_less_eq_nat @ X993 @ X992|(X991 @ X993)=(zero_zero_nat)|~number1551313001itions @ X991 @ X992))&((groups1842438620at_nat @ (esk3_2 @ X991) @ (set_ord_atMost_nat @ X992))=(X992)|~number1551313001itions @ X991 @ X992))&(((X994 @ (esk34_2 @ X994 @ X995))!=(zero_zero_nat)|(groups1842438620at_nat @ (esk3_2 @ X994) @ (set_ord_atMost_nat @ X995))!=(X995)|number1551313001itions @ X994 @ X995)&(~ord_less_eq_nat @ one_one_nat @ (esk34_2 @ X994 @ X995)|~ord_less_eq_nat @ (esk34_2 @ X994 @ X995) @ X995|(groups1842438620at_nat @ (esk3_2 @ X994) @ (set_ord_atMost_nat @ X995))!=(X995)|number1551313001itions @ X994 @ X995))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])).
0.21/0.55	thf(c_0_14, negated_conjecture, (minus_minus_nat @ (groups1842438620at_nat @ (esk3_2 @ p) @ (set_ord_atMost_nat @ n)) @ k)!=(minus_minus_nat @ n @ k), inference(split_conjunct,[status(thm)],[c_0_10])).
0.21/0.55	thf(c_0_15, plain, (minus_minus_nat @ (groups1842438620at_nat @ (esk3_2 @ p) @ (set_ord_atMost_nat @ n)) @ k)=(groups1842438620at_nat @ esk1_1 @ (set_ord_atMost_nat @ n)), inference(rw,[status(thm)],[c_0_11, c_0_12])).
0.21/0.55	thf(c_0_16, plain, ![X21:nat > nat, X1:nat]:((groups1842438620at_nat @ (esk3_2 @ X21) @ (set_ord_atMost_nat @ X1))=(X1)|~number1551313001itions @ X21 @ X1), inference(split_conjunct,[status(thm)],[c_0_13])).
0.21/0.55	thf(c_0_17, plain, number1551313001itions @ p @ n, inference(split_conjunct,[status(thm)],[fact_0_partitions])).
0.21/0.55	thf(c_0_18, negated_conjecture, (groups1842438620at_nat @ esk1_1 @ (set_ord_atMost_nat @ n))!=(minus_minus_nat @ n @ k), inference(rw,[status(thm)],[c_0_14, c_0_15])).
0.21/0.55	thf(c_0_19, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])]), c_0_18]), ['proof']).
0.21/0.55	# SZS output end CNFRefutation
0.21/0.55	# Proof object total steps             : 20
0.21/0.55	# Proof object clause steps            : 8
0.21/0.55	# Proof object formula steps           : 12
0.21/0.55	# Proof object conjectures             : 4
0.21/0.55	# Proof object clause conjectures      : 2
0.21/0.55	# Proof object formula conjectures     : 2
0.21/0.55	# Proof object initial clauses used    : 5
0.21/0.55	# Proof object initial formulas used   : 5
0.21/0.55	# Proof object generating inferences   : 1
0.21/0.55	# Proof object simplifying inferences  : 5
0.21/0.55	# Training examples: 0 positive, 0 negative
0.21/0.55	# Parsed axioms                        : 269
0.21/0.55	# Removed by relevancy pruning/SinE    : 0
0.21/0.55	# Initial clauses                      : 520
0.21/0.55	# Removed in clause preprocessing      : 47
0.21/0.55	# Initial clauses in saturation        : 473
0.21/0.55	# Processed clauses                    : 579
0.21/0.55	# ...of these trivial                  : 25
0.21/0.55	# ...subsumed                          : 203
0.21/0.55	# ...remaining for further processing  : 350
0.21/0.55	# Other redundant clauses eliminated   : 214
0.21/0.55	# Clauses deleted for lack of memory   : 0
0.21/0.55	# Backward-subsumed                    : 0
0.21/0.55	# Backward-rewritten                   : 4
0.21/0.55	# Generated clauses                    : 5054
0.21/0.55	# ...of the previous two non-trivial   : 4341
0.21/0.55	# Contextual simplify-reflections      : 0
0.21/0.55	# Paramodulations                      : 4326
0.21/0.55	# Factorizations                       : 8
0.21/0.55	# NegExts                              : 23
0.21/0.55	# Equation resolutions                 : 225
0.21/0.55	# Propositional unsat checks           : 0
0.21/0.55	#    Propositional check models        : 0
0.21/0.55	#    Propositional check unsatisfiable : 0
0.21/0.55	#    Propositional clauses             : 0
0.21/0.55	#    Propositional clauses after purity: 0
0.21/0.55	#    Propositional unsat core size     : 0
0.21/0.55	#    Propositional preprocessing time  : 0.000
0.21/0.55	#    Propositional encoding time       : 0.000
0.21/0.55	#    Propositional solver time         : 0.000
0.21/0.55	#    Success case prop preproc time    : 0.000
0.21/0.55	#    Success case prop encoding time   : 0.000
0.21/0.55	#    Success case prop solver time     : 0.000
0.21/0.55	# Current number of processed clauses  : 319
0.21/0.55	#    Positive orientable unit clauses  : 53
0.21/0.55	#    Positive unorientable unit clauses: 6
0.21/0.55	#    Negative unit clauses             : 12
0.21/0.55	#    Non-unit-clauses                  : 248
0.21/0.55	# Current number of unprocessed clauses: 4235
0.21/0.55	# ...number of literals in the above   : 16876
0.21/0.55	# Current number of archived formulas  : 0
0.21/0.55	# Current number of archived clauses   : 4
0.21/0.55	# Clause-clause subsumption calls (NU) : 19138
0.21/0.55	# Rec. Clause-clause subsumption calls : 7648
0.21/0.55	# Non-unit clause-clause subsumptions  : 169
0.21/0.55	# Unit Clause-clause subsumption calls : 1014
0.21/0.55	# Rewrite failures with RHS unbound    : 0
0.21/0.55	# BW rewrite match attempts            : 44
0.21/0.55	# BW rewrite match successes           : 18
0.21/0.55	# Condensation attempts                : 0
0.21/0.55	# Condensation successes               : 0
0.21/0.55	# Termbank termtop insertions          : 117816
0.21/0.55	
0.21/0.55	# -------------------------------------------------
0.21/0.55	# User time                : 0.189 s
0.21/0.55	# System time              : 0.011 s
0.21/0.55	# Total time               : 0.200 s
0.21/0.55	# Maximum resident set size: 2076 pages
0.21/0.55	EOF